Labelled Markov Processes
نویسنده
چکیده
Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is.. Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is.. Systems that can be in a state and have transitions between states; these transitions are triggered by actions. The transitions are annotated by labels that name the action. Systems that can be in a state and have transitions between states; these transitions are triggered by actions. The transitions are annotated by labels that name the action. [Invented by R. Keller 1976] The transitions can be nondeterministic. Systems that can be in a state and have transitions between states; these transitions are triggered by actions. The transitions are annotated by labels that name the action. [Invented by R. Keller 1976] The transitions can be nondeterministic. Intended to model communication and concurrency; the notion of observation is very different from what one uses in automata theory. Systems that can be in a state and have transitions between states; these transitions are triggered by actions. The transitions are annotated by labels that name the action. [Invented by R. Keller 1976] The transitions can be nondeterministic. Intended to model communication and concurrency; the notion of observation is very different from what one uses in automata theory. We do not see the states, we see the actions and we observe when actions are rejected by the system. Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is governed by a probability distribution-no other indeterminacy. Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is governed by a probability distribution-no other indeterminacy. All probabilistic data is internal-no probabilities associated with environment behaviour. Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is governed by a probability distribution-no other indeterminacy. All probabilistic data is internal-no probabilities associated with environment behaviour. We observe the interactions-not the internal states. Labelled Markov processes are probabilistic versions of labelled transition systems. Labelled transition systems where the final state is governed by a probability distribution-no other indeterminacy. All probabilistic data is internal-no probabilities associated with environment behaviour. We observe the interactions-not the internal states. In general, the state space of a labelled Markov process may be a continuum.
منابع مشابه
Approximating labelled Markov processes
Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. In this paper, we study approximation techniques for continuous-state labelled Markov processes. We show that the collection of labelled Markov processes carries a Polish-space structure with a countable basis given by finite-state Mar...
متن کاملBisimulation for Labelled Markov Processes
In this paper we introduce a new class of labelled transition systems Labelled Markov Processes and define bisimulation for them. Labelled Markov processes are probabilistic labelled transition systems where the state space is not necessarily discrete, it could be the reals, for example. We assume that it is a Polish space (the underlying topological space for a complete separable metric space)...
متن کاملDomain theory, testing and simulation for labelled Markov processes
This paper presents a fundamental study of similarity and bisimilarity for labelled Markov processes. The main results characterize similarity as a testing preorder and bisimilarity as a testing equivalence. In general, labelled Markov processes are not required to satisfy a finite-branching condition—indeed the state space may be a continuum, with the transitions given by arbitrary probability...
متن کاملDistribution-Based Bisimulation for Labelled Markov Processes
In this paper we propose a (sub)distribution-based bisimulation for labelled Markov processes and compare it with earlier definitions of state and event bisimulation, which both only compare states. In contrast to those state-based bisimulations, our distribution bisimulation is weaker, but corresponds more closely to linear properties. We construct a logic and a metric to describe our distribu...
متن کاملTrace Refinement in Labelled Markov Decision Processes
Given two labelled Markov decision processes (MDPs), the trace-refinement problem asks whether for all strategies of the first MDP there exists a strategy of the second MDP such that the induced labelled Markov chains are trace-equivalent. We show that this problem is decidable in polynomial time if the second MDP is a Markov chain. The algorithm is based on new results on a particular notion o...
متن کامل